Capacity allocation in wireless communication networks : models and analyses

This monograph has concentrated on capacity allocation in cellular and Wireless Local Area Networks, primarily with a network operator’s perspective. In the introduc- tory chapter, a reference model has been proposed for the extensive suite of capacity allocation mechanisms that can be applied at different time scales, in order to influ- ence the inherent trade-offs between investment costs, network capacity and service quality. The subsequent chapters presented a number of comprehensive studies with the objective to understand the joint impact of the different control mechanisms on the network operations and service provisioning, as well as the influence of the largely uncontrollable traffic and mobility characteristics on the system- and service-level performance

Performance analysis of adaptive scheduling in integrated services UMTS networks

For an integrated services UMTS network serving speech and data calls, we propose, evaluate and compare different scheduling schemes, which dynamically adapt the shared data transport channel rates to the varying speech traffic load. within each cell, the assigned data transfer resources are distributed over the present data flows according to certain fairness objectives. The performance of the adaptive schemes is numerically evaluated by means of analytical performance optimisation methods in combination with Monte Carlo simulations.\ud \u

Self-optimisation of admission control and handover parameters in LTE

In mobile cellular networks the handover (HO) algorithm is responsible for determining when calls of users that are moving from one cell to another are handed over from the former to the latter. The admission control (AC) algorithm, which is the algorithm that decides whether new (fresh or HO) calls that enter a cell are allowed to the cell or not, often tries to facilitate HO by prioritising HO calls in favour of fresh calls. In this way, a good quality of service (QoS) for calls that are already admitted to the network is pursued. In this paper, the effect of self-optimisation of AC parameters on the HO performance in a long term evolution (LTE) network is studied, both with and without the self-optimisation of HO parameters. Simulation results show that the AC parameter optimisation algorithm considerably improves the HO performance by reducing the amount of calls that are dropped prior to or during HO

Demonstrator for Objective Driven SON Operation

Abstract-The demonstrator shows a self-management system for heterogeneous mobile wireless networks that uses contextspecific and weighted Key Performance Indicator (KPI) target values defined by the operator to automatically and autonomously configure and control the operation of Self-Organising Network (SON) functions such that they contribute to achieving these KPI targets by appropriately optimising the network configuration. Changing KPI targets, context or weights leads to an automatic re-configuration of the SON functions by using a policy system, and the impact of the changes to the policy and the network configuration can be seen and traced in the demonstrator's realistic network scenario and KPI charts

Performance analysis of fair channel sharing policies in an integrated cellular voice/data network

We study channel sharing in an integrated cellular voice/data network with a finite queue for data call requests that cannot be served immediately upon arrival. Using analytical techniques, a comparison of different fair channel sharing policies is made. As a main result, a closed-form expression is derived for the expected sojourn time (waiting time plus transfer time) of a data call, conditional on its size, indicating that the sojourn time is proportional to the call size. This attractive proportionality result establishes an additional fairness property for the channel sharing policies proposed in the paper. Additionally, as a valuable intermediate result, the conditional expected sojourn time of an admitted data call is obtained, given the system state at arrival, which may serve as an appreciated feedback information service to the data source. An extensive numerical study is included to compare the proposed policies and to obtain insight in the performance effects of the various system and policy parameters

Performance analysis of fair channel sharing policies in an integrated cellular voice/data network

We study channel sharing in an integrated cellular voice/data network with a finite queue for data call requests that cannot be served immediately upon arrival. Using analytical techniques, a comparison of different fair channel sharing policies is made. As a main result, a closed-form expression is derived for the expected sojourn time (waiting time plus transfer time) of a data call, conditional on its size, indicating that the sojourn time is proportional to the call size. This attractive proportionality result establishes an additional fairness property for the channel sharing policies proposed in the paper. Additionally, as a valuable intermediate result, the conditional expected sojourn time of an admitted data call is obtained, given the system state at arrival, which may serve as an appreciated feedback information service to the data source. An extensive numerical study is included to compare the proposed policies and to obtain insight in the performance effects of the various system and policy parameters